A recursive algorithm for the infinity-norm fixed point problem
نویسندگان
چکیده
منابع مشابه
A recursive algorithm for the infinity-norm fixed point problem
We present the PFix algorithm for the fixed point problem f ðxÞ 1⁄4 x on a nonempty domain 1⁄2a; b ; where dX1; a; bAR ; and f is a Lipschitz continuous function with respect to the infinity norm, with constant qp1: The computed approximation x̃ satisfies the residual criterion jj f ðx̃Þ x̃jjNpe; where e40: In general, the algorithm requires no more than Pd i1⁄41s i function component evaluations,...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولHybrid steepest iterative algorithm for a hierarchical fixed point problem
The purpose of this work is to introduce and study an iterative method to approximate solutions of a hierarchical fixed point problem and a variational inequality problem involving a finite family of nonexpansive mappings on a real Hilbert space. Further, we prove that the sequence generated by the proposed iterative method converges to a solution of the hierarchical fixed point problem for a f...
متن کاملA Recursive Algorithm for Finding the Minimum Norm Point in an Unbounded Polyhedron
We present a recursive algorithm for finding the minimum norm point in an unbounded, wnvex and pointed polyhedron defined by finite sets of points and rays. The algorithm can start at an arbitrary point of the polyhedron and does not require to solve systems of linear equations.
متن کاملAIOSC: Analytical Integer Word-length Optimization based on System Characteristics for Recursive Fixed-point LTI Systems
The integer word-length optimization known as range analysis (RA) of the fixed-point designs is a challenging problem in high level synthesis and optimization of linear-time-invariant (LTI) systems. The analysis has significant effects on the resource usage, accuracy and efficiency of the final implementation, as well as the optimization time. Conventional methods in recursive LTI systems suffe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Complexity
سال: 2003
ISSN: 0885-064X
DOI: 10.1016/j.jco.2003.06.001